Перевод: со всех языков на русский

с русского на все языки

uniprocessor time-sharing system

См. также в других словарях:

  • IBM System/360 Model 67 — The IBM System/360 Model 67 (S/360 67) was an important IBM mainframe model in the late 1960s. It first shipped in July 1966. Unlike the rest of the S/360 series, it included features to facilitate time sharing applications, notably virtual… …   Wikipedia

  • Process (computing) — In computing, a process is an instance of a computer program that is being executed. It contains the program code and its current activity. Depending on the operating system (OS), a process may be made up of multiple threads of execution that… …   Wikipedia

  • PDP-11 — This article is about the PDP 11 series of minicomputers. For the PDP 11 processor architecture, see PDP 11 architecture. The PDP 11 was a series of 16 bit minicomputers sold by Digital Equipment Corporation (DEC) from 1970 into the 1990s, one of …   Wikipedia

  • Green threads — In computer programming, Green threads are threads that are scheduled by a Virtual Machine (VM) instead of natively by the underlying operating system. Green threads emulate multithreaded environments without relying on any native OS capabilities …   Wikipedia

  • Features removed from Windows Vista — While Windows Vista contains many new features, a number of capabilities and certain programs that were a part of Windows XP are no longer present or changed, resulting in the removal of certain functionality. The following is a list of features… …   Wikipedia

  • Windows NT 3.1 — Part of the Microsoft Windows family …   Wikipedia

  • Semaphore (programming) — For other uses, see Semaphore (disambiguation). In computer science, a semaphore is a variable or abstract data type that provides a simple but useful abstraction for controlling access by multiple processes to a common resource in a parallel… …   Wikipedia

  • Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»